Design of cellular networks with diversity and capacity constraints
نویسندگان
چکیده
This paper presents three mathematical models for network design of cellular networks. The models reflect varying degrees of complexity. Model #1 is a 1-period fixed-link capacity model. Three heuristics are used for solving this problem. All the heuristics first use linear programming relaxations to yield the near-optimal integer solution, then use then clever rounding-schemes to find the final solution. The three heuristics are compared with an integer branch-and-bound algorithm to show the efficacy of the heuristics and the speed with which they achieve their solution. The first heuristic is the best. An Appendix presents a detailed algorithmic description of the first heuristic. Model #2 allows the capacities of the links to vary. This is a much more difficult mathematical programming problem, yet certain features of the problem reveal valuable characteristics of the linear programming relaxations. Two heuristics are generated; the first heuristic is superior to the second. The heuristics are compared with an optimal branch-and-bound algorithm. Model #3 presents a multi-period demand problem. This is a very complex problem and, while no heuristics are developed and no computational experiments are shown, the structure of the final problem is similar to models #1 & #2; thus linear programming relaxations should be a viable strategy for its solution.
منابع مشابه
A Comprehensive Mathematical Model for the Design of a Dynamic Cellular Manufacturing System Integrated with Production Planning and Several Manufacturing Attributes
Dynamic cellular manufacturing systems, Mixed-integer non-linear programming, Production planning, Manufacturing attributes This paper presents a novel mixed-integer non-linear programming model for the design of a dynamic cellular manufacturing system (DCMS) based on production planning (PP) decisions and several manufacturing attributes. Such an integrated DCMS model with an extensi...
متن کاملAn Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks
High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...
متن کاملThe Least Cost Design of Water Distribution Networks Using Water Quality Constraints
Water quality is a very important issue related to people health, but it is not usually considered in water distribution networks (WDNs) design. In this paper, new constraints such as free residual chlorine and the quality performance index are incorporated into the least cost design of water distribution networks. EPANET2 was applied for the hydraulic and quality analysis of water distributio...
متن کاملInterdependent Security Game Design over Constrained Linear Influence Networks
In today's highly interconnected networks, security of the entities are often interdependent. This means security decisions of the agents are not only influenced by their own costs and constraints, but also are affected by their neighbors’ decisions. Game theory provides a rich set of tools to analyze such influence networks. In the game model, players try to maximize their utilities through se...
متن کاملJoint Allocation of Computational and Communication Resources to Improve Energy Efficiency in Cellular Networks
Mobile cloud computing (MCC) is a new technology that has been developed to overcome the restrictions of smart mobile devices (e.g. battery, processing power, storage capacity, etc.) to send a part of the program (with complex computing) to the cloud server (CS). In this paper, we study a multi-cell with multi-input and multi-output (MIMO) system in which the cell-interior users request service...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Reliability
دوره 49 شماره
صفحات -
تاریخ انتشار 2000